SHIN ABox Reduction
نویسندگان
چکیده
We propose a technique to make consistency detection scalable for large Aboxes in secondary storage. We use static analysis of knowledge representation with summarization techniques to produce a dramatically reduced proxy Abox. We show that the proxy Abox is consistent only if the original Abox is also consistent. We also show that, in practice, our techniques dramatically reduce the time and space requirements for consistency detection.
منابع مشابه
Finding Data Tractable Description Logics for Computing a Minimum Cost Diagnosis Based on ABox Decomposition
Ontology diagnosis is a well-known approach to handling inconsistency in a Description Logic (DL) based ontology, which computes a diagnosis of the ontology, i.e. a minimal subset of axioms in the ontology whose removal restores consistency. However, ontology diagnosis is computationally hard, especially in computing a minimum cost diagnosis (MCD), i.e. a diagnosis such that the sum of removal ...
متن کاملHandling Boolean A Boxes
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear reduction of such knowledge bases into a standard format (allowing only conjunctive assertions) is described which preserves knowledge base satisfiability. Similar results are presented for Boolean TBoxes and Boolean combi...
متن کاملFinite Model Reasoning in Horn Description Logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted to the inexpressive DL DL-LiteF , and is shown here to extend to the expressive Horn DL Horn-ALCFI. The m...
متن کاملA set-theoretical approach for ABox reasoning services (Extended Version)
In this paper we consider the most common ABox reasoning services for the description logic DL〈4LQS〉(D) (DL D , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQS. The description logic DL D is very expressive, as it admits various concept and role constructs, and data types, that allow one to represent rule-based languages ...
متن کاملar X iv : 1 70 2 . 03 09 6 v 6 [ cs . L O ] 3 M ay 2 01 7 A set - theoretic approach to ABox reasoning services ( Extended Version )
In this paper we consider the most common ABox reasoning services for the description logic DL〈4LQS〉(D) (DL D , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQS. The description logic DL D is very expressive, as it admits various concept and role constructs, and data types, that allow one to represent rule-based languages ...
متن کامل